Dynamic load balancing with enhanced shared-memory parallelism for particle-in-cell codes
نویسندگان
چکیده
منابع مشابه
A Distributed Shared Memory Cluster Architecture With Dynamic Load Balancing
This paper proposes a distributed shared memory cluster architecture with load balancing. The architecture is based on dynamic task scheduling approach for distribution and assignment. It enhances the performance of communication across clusters for data access. The proposed dynamic load balancing model uses the concept of work stealing, which intelligently balances the load among different nod...
متن کاملA Dynamic Load-balancing Scheme for XPath Queries Parallelization in Shared Memory Multi-core Systems
Due to the rapid popularity of multi-core processors systems, the parallelization of XPath queries in shared memory multi-core systems has been studied gradually. Existing work developed some parallelization methods based on cost estimation and static mapping, which could be seen as a logical optimization of parallel query plan. However, static mapping may result in load imbalance that hurts th...
متن کاملLoad Balancing with Memory
A standard load balancing model considers placing n balls into n bins by choosing d possible locations for each ball independently and uniformly at random and sequentially placing each in the least loaded of its chosen bins. It is well known that allowing just a small amount of choice (d = 2) greatly improves performance over random placement (d = 1). In this paper, we show that similar perform...
متن کاملDynamic mesh partitioning & load-balancing for parallel computational mechanics codes
We discuss the load-balancing issues arising in parallel mesh based computational mechanics codes for which the processor loading changes during the run. We briefly touch on geometric repartitioning ideas and then focus on different ways of using a graph both to solve the load-balancing problem and the optimisation problem, both locally and globally. We also briefly discuss whether repartitioni...
متن کاملParallel dynamic load-balancing for adaptive distributive memory PDE solvers
Many adaptive techniques for the solution of both steady and time-dependent PDEs rely on a hierarchy of meshes: starting with a coarse global mesh and reening this by diierent amounts in diierent regions. Since this reenement (or de-reenement) is part of the solution process it is necessary to dynamically alter the way in which the mesh is partitioned if a parallel implementation of such an alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2021
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2020.107633